Min-Max Timing Analysis and An Application to Asynchronous Circuits
نویسندگان
چکیده
Modern high-performance asynchronous circuits depend on timing constraints for correct operation, so timing analyzers are essential asynchronous design tools. In this paper, we present a 13-valued abstract waveform algebra and a polynomial-time min-max timing simulation algorithm for use in efficient, approximate timing analysis of asynchronous circuits with bounded component delays. Unlike several previous approaches, our algorithm computes separate propagation delay bounds from each circuit input to each internal gate. This is useful for analyzing asynchronous circuits, where the relative transition times of the inputs may not be known a priori, unlike synchronous circuits. We also describe an efficient reconvergent fanout analysis technique that helps in increasing the accuracy of simulation. We have applied our algorithm to build an efficient timing analysis tool for extended burst-mode circuits (a class of timing-dependent asynchronous circuits) implemented in the 3D design style [1]. Our tool analyzes gate-level 3D circuits assuming bounded component delays and determines safe timing constraints for correct operation. Although our results represent conservative approximations of the true timing requirements in the worst case, experiments indicate that our technique is efficient and fairly accurate in practice. Keywords— Approximate timing analysis, asynchronous circuits, extended burst-mode circuits, min-max timing simulation, polynomial-time analysis reconvergent fanout analysis, 3D circuits,
منابع مشابه
Timing Analysis of Digital Circuits and the Theory of Min-Max Functions
asynchronous circuit, clock schedule verification, cycle time, fixed point, max-plus algebra, min-max function Recent progress in the timing analysis of digital circuits has involved the use of maximum and minimum timing constraints. We put forward the theory of min-max functions, a non-linear generalization of max-plus algebra, as the correct framework in which to study problems with mixed con...
متن کاملMore Accurate Polynomial-Time Min-Max Timing Simulation
We describe a polynomial-time algorithm for min-max timing simulation of combinational circuits. Our algorithm reports conservative bounds on the propagationdelays from each primary input to each gate, for use in the timing verification of fundamental-mode asynchronous circuits. A new reconvergent fanout analysis technique is presented. Our algorithm produces more accurate results than previous...
متن کاملFsimac: a fault simulator for asynchronous sequential circuits
At very high frequencies, the major potential of asynchronous circuits is absence of clock skew and, through that, better exploitation of relative timing relations. This paper presents Fsimac, a gate-level fault simulator for stuck-at and gate-delay faults in asynchronous sequential circuits. Fsimac not only evaluates combinational logic and typical asynchronous gates such as Muller C-elements,...
متن کاملTiming analysis of asynchronous systems using time separation of events
This paper describes a pseudo-polynomial time algorithm for timing analysis of a class of choice-free asynchronous systems, called tightly-coupled systems, with both min and max type timing constraints and bounded component delays. The algorithm consists of two phases: (i) longterm behavior analysis, that computes bounds on the time separation of events after the system has run for a sufficient...
متن کاملSome Properties of Change Diagrams Extended Abstract
The paper investigates properties of change diagrams. They are able to model a subclass of concurrent systems, for example asynchronous circuits or timing diagrams. The following results are described: – Change diagrams are related to the class of dynamic min-max graphs. – Efficient algorithms for timing analysis are derived. – Liveness and boundedness properties are investigated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998